Computational problem - PDFSEARCH.IO - Document Search Engine

Computational problem
Results: 1172

#	Item
381	NIST PQC Talk A Simple Provably Secure (Authenticated) Key Exchange Scheme Based on the Learning with Errors Problem Jintai Ding Add to Reading List Source URL: csrc.nist.gov Language: English - Date: 2015-04-03 13:40:14 Hellman Computational hardness assumptions Finite fields Cryptography Public-key cryptography Cryptographic protocols
382	CCCG 2007, Ottawa, Ontario, August 20–22, 2007 Approximation Algorithms for the Minimum-Length Corridor and Related Problems Arturo Gonzalez-Gutierrez∗ Add to Reading List Source URL: cccg.ca Language: English - Date: 2008-10-28 21:25:22 NP-complete problems Operations research Approximation algorithm Travelling salesman problem APX Steiner tree problem Algorithm Set cover problem Reduction Theoretical computer science Computational complexity theory Applied mathematics
383	On k-Enclosing Objects in a Coloured Point Set Luis Barba∗ Stephane Durocher†‡ Debajyoti Mondal† Add to Reading List Source URL: www.cccg.ca Language: English - Date: 2013-08-11 21:51:56 Discrete mathematics Computational geometry Diagrams Voronoi diagram Proximity problems Time complexity Largest empty rectangle Smallest circle problem Mathematics Theoretical computer science Discrete geometry
384	The 118th RCKC Colloquium Search Result Diversification via Filling up Multiple Knapsacks Yu Haitao Add to Reading List Source URL: www.tsukuba.ac.jp Language: English - Date: 2014-12-09 20:27:32 Applied mathematics Combinatorial optimization Cryptography Dynamic programming Knapsack problem Mathematical optimization Optimization problem Recommender system Theoretical computer science Computational complexity theory Operations research
385	There is No EPTAS for Two-dimensional Knapsack Ariel Kulik∗ Hadas Shachnai† Abstract Add to Reading List Source URL: www.cs.technion.ac.il Language: English - Date: 2010-12-30 12:50:07 Dynamic programming Operations research Complexity classes Approximation algorithms Polynomial-time approximation scheme Knapsack problem Subset sum problem Parameterized complexity Optimization problem Theoretical computer science Computational complexity theory Applied mathematics
386	Journal of Computational and Applied Mathematics–227 www.elsevier.com/locate/cam Numerical solution of the Minkowski problem a Add to Reading List Source URL: www.rni.helsinki.fi Language: English - Date: 2008-04-16 06:00:33 Convex analysis Convex function Convex hull Vector space Convex set Continuous function Spherical harmonics Locally convex topological vector space Shapley–Folkman lemma Mathematical analysis Mathematics Algebra
387	Constraints DOIs10601The Complexity of Reasoning with Global Constraints Christian Bessiere · Emmanuel Hebrard · Brahim Hnich · Toby Walsh Add to Reading List Source URL: homepages.laas.fr Language: English - Date: 2010-11-22 06:22:29 Applied mathematics Mathematical optimization Local consistency Constraint satisfaction NP-complete Computational complexity theory P versus NP problem NP Complexity of constraint satisfaction Constraint programming Theoretical computer science Complexity classes
388	CCCG 2010, Winnipeg MB, August 9–11, 2010 New Variations of the Reverse Facility Location Problem Bhaswar B. Bhattacharya∗ Abstract Add to Reading List Source URL: cccg.ca Language: English - Date: 2010-07-19 10:46:19 Operations research Facility location Decision tree model Analysis of algorithms Reduction Theoretical computer science Computational complexity theory Applied mathematics
389	16th Canadian Conference on Computational Geometry, 2004 On Computing Enclosing Isosceles Triangles and Related Problems Prosenjit Bose Add to Reading List Source URL: www.cccg.ca Language: English - Date: 2004-08-23 15:27:23 Circles Triangle Circle packing in an isosceles right triangle Packing problem Geometry Triangles Triangle geometry
390	CCCG 2011, Toronto ON, August 10–12, 2011 Hardness Results for Two-Dimensional Curvature-Constrained Motion Planning David Kirkpatrick∗ Add to Reading List Source URL: 2011.cccg.ca Language: English - Date: 2011-08-06 04:11:16 NP-complete problems Network theory Shortest path problem Geodesic Travelling salesman problem Motion planning Trigonometric functions NP Curvature Theoretical computer science Mathematics Computational complexity theory

UPDATE